On the maximum number of maximum independent sets in connected graphs

on the number of maximum independent sets of graphs

let $g$ be a simple graph. an independent set is a set ofpairwise non-adjacent vertices. the number of vertices in a maximum independent set of $g$ isdenoted by $alpha(g)$. in this paper, we characterize graphs $g$ with $n$ vertices and with maximumnumber of maximum independent sets provided that $alpha(g)leq 2$ or $alpha(g)geq n-3$.

On the number of maximum independent sets in Doob graphs

The Doob graph D(m,n) is a distance-regular graph with the same parameters as the Hamming graph H(2m+n, 4). The maximum independent sets in the Doob graphs are analogs of the distance-2 MDS codes in the Hamming graphs. We prove that the logarithm of the number of the maximum independent sets in D(m,n) grows as 2(1+o(1)). The main tool for the upper estimation is constructing an injective map fr...

Towards Maximum Independent Sets on Massive Graphs

Maximum independent set (MIS) is a fundamental problem in graph theory and it has important applications in many areas such as social network analysis, graphical information systems and coding theory. The problem is NP-hard, and there has been numerous studies on its approximate solutions. While successful to a certain degree, the existing methods require memory space at least linear in the siz...

On maximum number of minimal dominating sets in graphs

On Perfect and Unique Maximum Independent Sets in Graphs

A perfect independent set I of a graph G is defined to be an independent set with the property that any vertex not in I has at least two neighbors in I. For a nonnegative integer k, a subset I of the vertex set V (G) of a graph G is said to be k-independent, if I is independent and every independent subset I ′ of G with |I | > |I| − (k − 1) is a subset of I. A set I of vertices of G is a super ...